Parallel Machine Production and Transportation Operations’ Scheduling with Tight Time Windows
نویسندگان
چکیده
منابع مشابه
A GRASP for Parallel Machine Scheduling with Time Windows
T paper presents a greedy randomized adaptive search procedure (GRASP) for scheduling n jobs on m nonhomogeneous parallel machines with time windows. An additional feature of the problem is that each job falls into one of priority classes. The objective is to maximize the number of jobs scheduled, where a job in a higher priority class has infinitely more value than a job in a lower priority cl...
متن کاملParallel machine scheduling with common due windows
In this paper, we consider a machine scheduling problem where jobs should be completed at times as close as possible to their respective due dates, and hence both earliness and tardiness should be penalized. Specifically, we consider the problem with a set of independent jobs to be processed on several identical parallel machines. All the jobs have a given common due window. If a job is complet...
متن کاملA Branch-and-Price Algorithm for Parallel Machine Scheduling with Time Windows and Job Priorities
This paper presents a branch-and-price algorithm for scheduling n jobs on m nonhomogeneous parallel machines with multiple time windows. An additional feature of the problem is that each job falls into one of ρ priority classes and may require two operations. The objective is to maximize the weighted number of jobs scheduled, where a job in a higher priority class has “infinitely” more weight o...
متن کاملIntegrated scheduling of production and delivery with time windows
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...
متن کاملParallel-Batch Scheduling and Transportation Coordination with Waiting Time Constraint
This paper addresses a parallel-batch scheduling problem that incorporates transportation of raw materials or semifinished products before processing with waiting time constraint. The orders located at the different suppliers are transported by some vehicles to a manufacturing facility for further processing. One vehicle can load only one order in one shipment. Each order arriving at the facili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complexity
سال: 2020
ISSN: 1076-2787,1099-0526
DOI: 10.1155/2020/1381340